Finite Automata and Unions of Regular Patterns with Bounded Constant Segments
نویسندگان
چکیده
The class of unbounded unions of regular pattern languages with bounded constant segments is identifiable from positive data in the limit [1]. Otherwise, no efficient algorithm that performs the inference of this class of languages is known. We propose a solution to this problem using the existing connexion between the positive variety of languages of dot depth 1/2, LJ [2] and the class of unbounded union of pattern languages RPL.
منابع مشابه
Characterizing the Regular Prefix Codes and Right Power-Bounded Languages
This paper was motivated by the work of Thierrin [8], where right power-bounded languages are introduced as those languages L having an upper bound n so that k < n whenever uvk E L with v # X. Such languages are related to various versions of noncounting languages (see, e.g. [ 1,6]). Two natural questions about the family R of regular right-power bounded languages are, first, a characterization...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملComplexity Bounds of Constant-Space Quantum Computation
We realize constant-space quantum computation by measure-many two-way quantum finite automata and evaluate their language recognition power by analyzing patterns of their exotic behaviors and by exploring their structural properties. In particular, we show that, when the automata halt “in finite steps” along all computation paths, they must terminate in worstcase liner time. In the bounded-erro...
متن کاملA Catalog for Prediction-Preserving Reducibility with Membership Queries on Formal Languages
This paper presents several results of prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages. We mainly deal with two kinds of concept classes, simple CFGs and finite unions of regular pattern languages. For the former, we show that DNF formulas are pwm-reducible to CFGs that is sequential or that contains at most one nonterminal. For the latter, on t...
متن کاملCharacterizations of 1-Way Quantum Finite Automata
The 2-way quantum finite automaton introduced by Kondacs and Watrous[KW97] can accept non-regular languages with bounded error in polynomial time. If we restrict the head of the automaton to moving classically and to moving only in one direction, the acceptance power of this 1-way quantum finite automaton is reduced to a proper subset of the regular languages. In this paper we study two differe...
متن کامل